Energy-efficient algorithms
نویسندگان
چکیده
منابع مشابه
Energy-efficient Algorithms for Sensor Networks
This report presents two algorithms for sensor networks that save the energy used when sensors communicate. The first is Information Driven Sensor Querying (IDSQ). This technique uses a utility measure, such as the Mahalanobis distance or mutual information, to limit the number of sensors that need to communicate. The second technique is Distributed Source Coding Using Syndromes (DISCUS). This ...
متن کاملEnergy-Efficient Scheduling: Classification, Bounds, and Algorithms
The problem of attaining energy efficiency in distributed systems is of importance, but a general, non-domain-specific theory of energy-minimal scheduling is far from developed. In this paper, we classify the problems of energy-minimal scheduling and present theoretical foundations of the same. We derive results concerning energyminimal scheduling of independent jobs in a distributed system wit...
متن کاملEfficient Implementation Algorithms for Homogenized Energy Models
The homogenized energy framework quantifying ferroelectric and ferromagnetic hysteresis is increasingly used for comprehensive material characterization and model-based control design. For operating regimes in which thermal relaxation mechanisms and stress-dependencies are negligible, existing algorithms are sufficiently efficient to permit device optimization and the potential for real-time co...
متن کاملEnergy Efficient Routing Algorithms for Acquiring Information from Smart Badges
The terrorist attacks on the World Trade Center and the Pentagon on September 11, 2001 have drawn attention to the use of wireless technology in order to locate survivors of structural collapse. We propose to construct an ad hoc network of wireless smart badges in order to acquire information from trapped survivors. We investigate the energy efficient routing problem that arises in such a netwo...
متن کاملPrimal Dual Gives Optimal Energy Efficient Online Algorithms
We consider the problem of online scheduling of jobs on unrelated machines with dynamic speed scaling to minimize the sum of energy and weighted flow time. We give an algorithm with an almost optimal competitive ratio for arbitrary power functions. (No earlier results handled arbitrary power functions for unrelated machines.) For power functions of the form f(s) = s for some constant α > 1, we ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications of the ACM
سال: 2010
ISSN: 0001-0782,1557-7317
DOI: 10.1145/1735223.1735245